Searching and encoding for infinite ordered sets
نویسندگان
چکیده
منابع مشابه
Searching in Random Partially Ordered Sets
We consider the problem of searching for a given element in a partially ordered set. More precisely, we address the problem of computing efficiently near-optimal search strategies for typical partial orders. We consider two classical models for random partial orders, the random graph model and the uniform model. We shall show that certain simple, fast algorithms are able to produce nearly-optim...
متن کاملOrdered sets with no infinite antichains
One approach to analyzing the structure of an ordered set has been to characterize its structure in terms of that of related objects, and vice versa. For example results in [2] characterize in terms of the ordered set P when the lattice Z(P) of lower sets (also called initial segments) of P and the ordered set Id(P) of order ideals (or simply ideals) of P have infinite antichains. The results i...
متن کاملComplete ordered sets with no infinite antichains
There are several standard constructions by which an arbitrary ordered set P is extended to one in which every subset has an. infimum and a supremuma complete ordered set. The collection I(P) of all initial segments of P ordered by inclusion is one. [A subset I of P is an initial segment if, for x, y E P, x E I whenever x s y and y E I.] I(P) is a complete distributive lattice. AnoWr is the fam...
متن کاملFUZZY ORDERED SETS AND DUALITY FOR FINITE FUZZY DISTRIBUTIVE LATTICES
The starting point of this paper is given by Priestley’s papers, where a theory of representation of distributive lattices is presented. The purpose of this paper is to develop a representation theory of fuzzy distributive lattices in the finite case. In this way, some results of Priestley’s papers are extended. In the main theorem, we show that the category of finite fuzzy Priestley space...
متن کاملRectangles are Better than Chains for Encoding Partially Ordered Sets
Partial orders have applications in various areas in computer science such as distributed systems, object oriented languages, knowledge representation systems and databases. In this paper we present a new technique to encode partially ordered sets or posets. Specifically, we use the family of two-dimensional posets, which we refer to as rectangles, to encode a given poset; an element x is less ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer & Information Sciences
سال: 1982
ISSN: 0091-7036,1573-7640
DOI: 10.1007/bf00993200